New hard benchmark for flowshop scheduling problems minimising makespan
نویسندگان
چکیده
منابع مشابه
New hard benchmark for flowshop scheduling problems minimising makespan
In this work a new benchmark of hard instances for the permutation flowshop scheduling problem with the objective of minimising the makespan is proposed. The new benchmark consists of 240 large instances and 240 small instances with up to 800 jobs and 60 machines. One of the objectives of the work is to generate a benchmark which satisfies the desired characteristics of any benchmark: comprehen...
متن کاملA New Improved NEH Heuristic for Permutation Flowshop Scheduling Problems
Job evaluation and differentiation are crucial in scheduling. Since jobs can be represented by vectors of processing times, the average, standard deviation, and skewness of job processing times can be defined as the moments of their probability distribution. The first and the second moments of processing times are effective in sorting jobs (Dong et al., 2008), however they are not yet optimized...
متن کاملMakespan minimization of a flowshop sequence-dependent group scheduling problem
The flowshop sequence dependent group scheduling problem with minimization of makespan as the objective (Fm|fmls, Splk, prmu|Cmax) is considered in this paper. It is assumed that several groups with different number of jobs are assigned to a flow shop cell that has m machines. The goal is to find the best sequence of processing the jobs in each group and the groups themselves with minimization ...
متن کاملOn Solving Flowshop Scheduling Problems
This paper proposes two variants of heuristic algorithms to solve the classic permutation flowshop scheduling problem. Both algorithms are simple and very efficient. The first algorithm is a constructive heuristic which builds the optimal schedule of jobs on the basis of a selective-greedy process. To escape the trap of local optimum points, for the second heuristic algorithm a stochastic featu...
متن کاملBenchmark Problems for Oversubscribed Scheduling
When organizing a scheduling competition one important issue is identifying the test problems for which the participating teams should demonstrate the performance of their approach. Ideally, the results of a competitive evaluation of different approaches should be useful to both scheduling researchers and practitioners. To enable this, we believe that the process of producing problem instances ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2015
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2014.07.033